TSTP Solution File: ITP153^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP153^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 08:07:09 EDT 2024

% Result   : Theorem 0.44s 0.68s
% Output   : CNFRefutation 0.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   24 (   5 unt;  11 typ;   0 def)
%            Number of atoms       :   21 (   0 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   70 (   8   ~;   4   |;   3   &;  54   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    6 (   0   ^   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    set_Product_prod_a_a: $tType ).

thf(decl_sort2,type,
    a: $tType ).

thf(decl_sort3,type,
    set_a: $tType ).

thf(decl_sort4,type,
    product_prod_a_a: $tType ).

thf(decl_69,type,
    product_Pair_a_a: a > a > product_prod_a_a ).

thf(decl_100,type,
    member449909584od_a_a: product_prod_a_a > set_Product_prod_a_a > $o ).

thf(decl_102,type,
    member_a: a > set_a > $o ).

thf(decl_103,type,
    carrier: set_a ).

thf(decl_104,type,
    relation: set_Product_prod_a_a ).

thf(decl_105,type,
    y: a ).

thf(decl_106,type,
    z: a ).

thf(conj_0,conjecture,
    ( ( member_a @ z @ carrier )
    & ( member_a @ y @ carrier ) ),
    file('/export/starexec/sandbox/tmp/tmp.EUnJO1lNXK/E---3.1_29952.p',conj_0) ).

thf(fact_8_not__outside,axiom,
    ! [X3: a,X4: a] :
      ( ( member449909584od_a_a @ ( product_Pair_a_a @ X3 @ X4 ) @ relation )
     => ( member_a @ X3 @ carrier ) ),
    file('/export/starexec/sandbox/tmp/tmp.EUnJO1lNXK/E---3.1_29952.p',fact_8_not__outside) ).

thf(fact_0_assms,axiom,
    ( ( member449909584od_a_a @ ( product_Pair_a_a @ z @ y ) @ relation )
    & ( member449909584od_a_a @ ( product_Pair_a_a @ y @ z ) @ relation ) ),
    file('/export/starexec/sandbox/tmp/tmp.EUnJO1lNXK/E---3.1_29952.p',fact_0_assms) ).

thf(c_0_3,negated_conjecture,
    ~ ( ( member_a @ z @ carrier )
      & ( member_a @ y @ carrier ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_4,plain,
    ! [X1279: a,X1280: a] :
      ( ~ ( member449909584od_a_a @ ( product_Pair_a_a @ X1279 @ X1280 ) @ relation )
      | ( member_a @ X1279 @ carrier ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_not__outside])])]) ).

thf(c_0_5,negated_conjecture,
    ( ~ ( member_a @ z @ carrier )
    | ~ ( member_a @ y @ carrier ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

thf(c_0_6,plain,
    ! [X1: a,X2: a] :
      ( ( member_a @ X1 @ carrier )
      | ~ ( member449909584od_a_a @ ( product_Pair_a_a @ X1 @ X2 ) @ relation ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,plain,
    member449909584od_a_a @ ( product_Pair_a_a @ z @ y ) @ relation,
    inference(split_conjunct,[status(thm)],[fact_0_assms]) ).

thf(c_0_8,negated_conjecture,
    ( ~ ( member_a @ z @ carrier )
    | ~ ( member_a @ y @ carrier ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    member_a @ z @ carrier,
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

thf(c_0_10,plain,
    member449909584od_a_a @ ( product_Pair_a_a @ y @ z ) @ relation,
    inference(split_conjunct,[status(thm)],[fact_0_assms]) ).

thf(c_0_11,negated_conjecture,
    ~ ( member_a @ y @ carrier ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

thf(c_0_12,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.17  % Problem    : ITP153^1 : TPTP v8.1.2. Released v7.5.0.
% 0.18/0.19  % Command    : run_E %s %d THM
% 0.18/0.40  % Computer : n025.cluster.edu
% 0.18/0.40  % Model    : x86_64 x86_64
% 0.18/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40  % Memory   : 8042.1875MB
% 0.18/0.40  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40  % CPULimit   : 300
% 0.18/0.40  % WCLimit    : 300
% 0.18/0.40  % DateTime   : Fri May  3 12:22:13 EDT 2024
% 0.18/0.40  % CPUTime    : 
% 0.37/0.59  Running higher-order theorem proving
% 0.37/0.59  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.EUnJO1lNXK/E---3.1_29952.p
% 0.44/0.68  # Version: 3.1.0-ho
% 0.44/0.68  # Preprocessing class: HSLSSMSMSSMCHFA.
% 0.44/0.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.68  # Starting full_lambda_5 with 1500s (5) cores
% 0.44/0.68  # Starting new_ho_12 with 300s (1) cores
% 0.44/0.68  # Starting pre_casc_5 with 300s (1) cores
% 0.44/0.68  # Starting full_lambda_9 with 300s (1) cores
% 0.44/0.68  # full_lambda_9 with pid 30131 completed with status 0
% 0.44/0.68  # Result found by full_lambda_9
% 0.44/0.68  # Preprocessing class: HSLSSMSMSSMCHFA.
% 0.44/0.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.68  # Starting full_lambda_5 with 1500s (5) cores
% 0.44/0.68  # Starting new_ho_12 with 300s (1) cores
% 0.44/0.68  # Starting pre_casc_5 with 300s (1) cores
% 0.44/0.68  # Starting full_lambda_9 with 300s (1) cores
% 0.44/0.68  # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.44/0.68  # Search class: HGHSM-FSLM31-DHFFFFBN
% 0.44/0.68  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.68  # Starting new_ho_10 with 55s (1) cores
% 0.44/0.68  # new_ho_10 with pid 30136 completed with status 0
% 0.44/0.68  # Result found by new_ho_10
% 0.44/0.68  # Preprocessing class: HSLSSMSMSSMCHFA.
% 0.44/0.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.68  # Starting full_lambda_5 with 1500s (5) cores
% 0.44/0.68  # Starting new_ho_12 with 300s (1) cores
% 0.44/0.68  # Starting pre_casc_5 with 300s (1) cores
% 0.44/0.68  # Starting full_lambda_9 with 300s (1) cores
% 0.44/0.68  # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.44/0.68  # Search class: HGHSM-FSLM31-DHFFFFBN
% 0.44/0.68  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.68  # Starting new_ho_10 with 55s (1) cores
% 0.44/0.68  # Preprocessing time       : 0.006 s
% 0.44/0.68  # Presaturation interreduction done
% 0.44/0.68  
% 0.44/0.68  # Proof found!
% 0.44/0.68  # SZS status Theorem
% 0.44/0.68  # SZS output start CNFRefutation
% See solution above
% 0.44/0.68  # Parsed axioms                        : 452
% 0.44/0.68  # Removed by relevancy pruning/SinE    : 257
% 0.44/0.68  # Initial clauses                      : 300
% 0.44/0.68  # Removed in clause preprocessing      : 21
% 0.44/0.68  # Initial clauses in saturation        : 279
% 0.44/0.68  # Processed clauses                    : 349
% 0.44/0.68  # ...of these trivial                  : 6
% 0.44/0.68  # ...subsumed                          : 70
% 0.44/0.68  # ...remaining for further processing  : 272
% 0.44/0.68  # Other redundant clauses eliminated   : 42
% 0.44/0.68  # Clauses deleted for lack of memory   : 0
% 0.44/0.68  # Backward-subsumed                    : 1
% 0.44/0.68  # Backward-rewritten                   : 3
% 0.44/0.68  # Generated clauses                    : 56
% 0.44/0.68  # ...of the previous two non-redundant : 36
% 0.44/0.68  # ...aggressively subsumed             : 0
% 0.44/0.68  # Contextual simplify-reflections      : 13
% 0.44/0.68  # Paramodulations                      : 7
% 0.44/0.68  # Factorizations                       : 0
% 0.44/0.68  # NegExts                              : 0
% 0.44/0.68  # Equation resolutions                 : 42
% 0.44/0.68  # Disequality decompositions           : 0
% 0.44/0.68  # Total rewrite steps                  : 30
% 0.44/0.68  # ...of those cached                   : 13
% 0.44/0.68  # Propositional unsat checks           : 0
% 0.44/0.68  #    Propositional check models        : 0
% 0.44/0.68  #    Propositional check unsatisfiable : 0
% 0.44/0.68  #    Propositional clauses             : 0
% 0.44/0.68  #    Propositional clauses after purity: 0
% 0.44/0.68  #    Propositional unsat core size     : 0
% 0.44/0.68  #    Propositional preprocessing time  : 0.000
% 0.44/0.68  #    Propositional encoding time       : 0.000
% 0.44/0.68  #    Propositional solver time         : 0.000
% 0.44/0.68  #    Success case prop preproc time    : 0.000
% 0.44/0.68  #    Success case prop encoding time   : 0.000
% 0.44/0.68  #    Success case prop solver time     : 0.000
% 0.44/0.68  # Current number of processed clauses  : 47
% 0.44/0.68  #    Positive orientable unit clauses  : 26
% 0.44/0.68  #    Positive unorientable unit clauses: 0
% 0.44/0.68  #    Negative unit clauses             : 4
% 0.44/0.68  #    Non-unit-clauses                  : 17
% 0.44/0.68  # Current number of unprocessed clauses: 150
% 0.44/0.68  # ...number of literals in the above   : 424
% 0.44/0.68  # Current number of archived formulas  : 0
% 0.44/0.68  # Current number of archived clauses   : 188
% 0.44/0.68  # Clause-clause subsumption calls (NU) : 6001
% 0.44/0.68  # Rec. Clause-clause subsumption calls : 1974
% 0.44/0.68  # Non-unit clause-clause subsumptions  : 76
% 0.44/0.68  # Unit Clause-clause subsumption calls : 57
% 0.44/0.68  # Rewrite failures with RHS unbound    : 0
% 0.44/0.68  # BW rewrite match attempts            : 19
% 0.44/0.68  # BW rewrite match successes           : 11
% 0.44/0.68  # Condensation attempts                : 349
% 0.44/0.68  # Condensation successes               : 0
% 0.44/0.68  # Termbank termtop insertions          : 33053
% 0.44/0.68  # Search garbage collected termcells   : 9090
% 0.44/0.68  
% 0.44/0.68  # -------------------------------------------------
% 0.44/0.68  # User time                : 0.041 s
% 0.44/0.68  # System time              : 0.014 s
% 0.44/0.68  # Total time               : 0.055 s
% 0.44/0.68  # Maximum resident set size: 3836 pages
% 0.44/0.68  
% 0.44/0.68  # -------------------------------------------------
% 0.44/0.68  # User time                : 0.057 s
% 0.44/0.68  # System time              : 0.018 s
% 0.44/0.68  # Total time               : 0.074 s
% 0.44/0.68  # Maximum resident set size: 2752 pages
% 0.44/0.68  % E---3.1 exiting
% 0.44/0.68  % E exiting
%------------------------------------------------------------------------------